MKAS : A modular knockout ATM switch

Simple Knockout Switch [11 exhibits excellent traffic performance (cell loss, cell delay and maximum throughput etc.) under uniform as well as non-uniform traffic patterns (2-6). But being a single stage, its hardware complexity is directly proportional to the switch size N. This problem may bind its implementation for largescale requirements because of the technological and physical constraints of packaging (e. g. chip or board size). Here, we are proposing a two-stage Modular Knockout ATM Switch architecture, which is extendable to large-scale switch sizes without sacrificing any significant decrease in switch performance. The concept of Generalised Knockout Principle in conjunction with Simple Knockout Principle has been utilised to filter, route and resolve the output contention problems in distributed fashion. Using distributed address filtration and shared concentration techniques simplifies the switch functions and reduces the switch complexity to large extent in terms of filters, switching elements and input output interconnection wires

Packet Loss Rate Differentiation in slotted Optical Packet Switching OCDM/WDM

We propose a multi-class mechanism for Optical Code Division Multiplexing (OCDM), Wavelength Division Multiplexing (WDM) Optical Packet Switch (OPS) architecture capable of supporting Quality of Service (QoS) transmission. OCDM/WDM has been proposed as a competitive hybrid switching technology to support the next generation optical Internet. This paper addresses performance issues in the slotted OPS networks and proposed four differentiation schemes to support Quality of Service. In addition, we present a comparison between the proposed schemes as well as, a simulation scheduler design which can be suitable for the core switch node in OPS networks. Using software simulations the performance of our algorithm in terms of losing probability, the packet delay, and scalability is evaluated

Adaptive dual threshold multi-class scheduling for packet switch.

Multimedia applications such as video conferencing, VoIP and data streaming require specified QoS to guarantee their performance. Multi-class switch has been introduced to handle different QoS requirement. In this research, a new way of handling multi-class traffic is presented. The analysis is done on N × N switch with two traffic classes; high priority for delay sensitive cells (class 1) and low priority for loss sensitive cells (class 0). In order to avoid starvation problem and to improve total mean delay in loss sensitive class, a novel approach has been introduced in the scheduling technique. The controller in the scheduler will adjust the threshold value adaptively based on the mean queue length and traffic load condition. By adjusting these parameters adaptively the best possible mean delay and throughput for class 0 can be achieved without degrading the QoS requirement for class 1.The proposed method has been simulated to show the performance of adaptive threshold as compared to priority queue(PQ) and Weighted Fair Queue(WFQ) in term of total mean delay and throughput. The results show that the proposed architecture has achieved better performance as compared to PQ and WFQ

An Improved Optimization Model of Internet Charging Scheme in Multi Service Networks

This article will analyze new improved charging scheme with base price, quality premium and QoS networks involved. Sain and Herpers [5] already attempted to obtain revenue maximization by creating charging scheme of internet. The plan is attempted to solve multi service networks scheme as an optimization model to obtain revenue maximization using our improved model based on Byun and Chatterjee [2] and Sain and Herpers [5]. The results show that improved model can be solved optimally using optimization tool LINGO to achieve better revenue maximization. Better results are obtained in all cases rather than in [5]. The advantage of our new model is that ISP also can set up their base price and quality premium based on ISP preferences. For some cases for getting revenue maximization, we do not offer one service and just utilize some of the services

Cell drop threshold architecture for multi-class shared buffer with finite memory size

Shared buffer is commonly used to utilize the buffer in the switch. In order to minimize the cell lost of high class traffic in multi-class switch, the threshold is set to drop the low class cells in the shared buffer. This will give more space to accommodate the high class traffic cells. In this paper, we analyse the performance of shared buffer with different threshold settings. The multi-class shared buffer architecture is developed for 16x16 ports switch, which is targeted for Xilinx FPGA implementation. The performance of the multi-class shared buffer switch is analysed in term of the achievable throughput as well as the drop probability. Based on the simulation with different threshold settings, it is observed that the optimum selection of cell drop threshold depends on the size of the shared buffer that triggers the RAM threshold

The comparison of internet pricing scheme in multi link bottleneck multi service network

In this research we set up pricing scheme of multilink internet bottleneck for multi-service network by giving the modified models and the solution.This model is based on the local server data in Palembang.Internet Service Provider (ISP) requires the appropriate pricing schemes in order to maximize revenue and provide quality services that can satisfy the Internet users.The model established by setting the base price (α) as constants and the premium quality of service (β) as variables and constants.Then the model will be solved using Program LINGO 13.0 to obtain the optimal solution.From the results obtained shows the optimal solution that ISP can use the models to generate maximum revenue and gives options according to the user needs in accordance with the goal of ISP.The optimal solution results compared to previous work show that the larger dimension of the problem, the goals can also change according to the needs. From LINGO 13.0, the solution for four services and 3 links offered were maximized when we set up the base price (α) as constants and the premium quality of service (β) as constants for Ii = Ii-1. So ISP can use the modification scheme to achieve its goals.The realistic case to be solved by LINGO 13.0 is limited to have only four services and three links

Implementation of multi-class shared buffer with finite memory size

High packet network have become an essential in modern multimedia communication. Shared buffer is commonly used to utilize the buffer in the switch. In this paper, we analyse the performance of shared buffer with different memory sizes. The architecture of the multi-class shared buffer is developed for 16×16 ports switch that is targeted in Xilinx FPGA. The performance of the multi-class shared buffer switch is analysed in term of throughput and mean delay. Based on the simulation with different memory sizes, it is observed that the optimum selection of memory size under uniform traffic depends on the maximum traffic load of the switch

Non-uniform traffic performance of multi-class scheduling technique with dual threshold.

Network with many types of traffic such as video conferencing, audio and data transfer requires a specific Quality of Services (QoS)to maintain their performance. It is crucial for the switch designer to guarantee QoS for all applications. In this paper,a new way of handling multi -class traffic has been presented. The analysis is done on 16x16 switch with two priority traffic classes and dual threshold setting.Dual threshold setting is implemented on the 16x16 switch to ensure a better control on the priority setting for both classes.In the reality, switch application operates under non-uniform traffic condition.Thus,the analysis in this paper is done under two different kind of non-uniform traffic patterns which are known as the hot-spot pattern and Community-of-Interest (COI) pattern. The roposed method is simulated to show that the delay performance of the non-uniform traffic patterns for the proposed switch architecture has been improved

Wavelength requirements for a scalable multicast single‐hop WDM network

In this paper, we present a method for designing a passive optical based single-hop wavelength division multiplexing multicast architecture that can achieve a scalable structure and form the basis of a wavelength efficient single-hop WDM network. The proposed architecture minimizes the number of wavelengths required for efficient multicast service and also minimizes tunability requirement of the transceivers. The network size scalability is achieved by adding transmitters and receivers to the designated groups. We show that the proposed system can accommodate large tuning delays and keeps with suitable throughput when the number of wavelength is equal to the number of nodes. We also show that the design can lead to a scalable structure while minimizing the number of wavelengths and tunability of the transceivers required for an efficient multicast service resulting in an improved system throughput and delay performance

A tracable proactive anonymous electronic cash

In this paper, we propose a traceable anonymous electronic cash, based on Digital Signature Scheme (DSS), but with difference whereby the coin's anonymity can be revoke by a quorum of the server. Our system, unlike previous anonymous systems, can prevent crimes from successfully being perpetrated, and employs revocation to do so. We introduce this traceable electronic cash that require a quorum of servers to produce a signature to the receiver, and a (possibly different) quorum to be unblended the coin. We also applied the method of bints to our protocol to enable tracing of correctness of the signature, and the corresponding coins